Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem
نویسندگان
چکیده
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential-algebraic system, in verifying if the system is structurally solvable for every state, and if not in finding a state in which the system is structurally singular. We give an integer linear programming formulation for the problem. We also identify some classes of valid inequalities and characterize when these inequalities define facets for the associated polytope. Moreover, we devise separation routines for these inequalities. Based on this, we develop a Branch-and-Cut algorithm along with experimental results are presented.
منابع مشابه
The Robust Network Loading Problem under Polyhedral Demand Uncertainty: Formulation, Polyhedral Analysis and Computations
We consider the Network Loading Problem under a polyhedral uncertainty description of traffic demands. After giving a compact multi-commodity formulation of the problem, we prove an unexpected decomposition property obtained from projecting out the flow variables, considerably simplifying the resulting polyhedral analysis and computations by doing away with metric inequalities, an attendant fea...
متن کاملA branch and cut algorithm for hub location problems with single assignment
The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and...
متن کاملA Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints
In this paper we study linear optimization problems with a newly introduced concept of multidimensional polyhedral linear second-order stochastic dominance constraints. By using the polyhedral properties of this dominance condition we present a cutting-surface algorithm, and show its finite convergence. The cut generation problem is a difference of convex functions (DC) optimization problem. We...
متن کاملThe Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
W consider the network loading problem (NLP) under a polyhedral uncertainty description of traffic demands. After giving a compact multicommodity flow formulation of the problem, we state a decomposition property obtained from projecting out the flow variables. This property considerably simplifies the resulting polyhedral analysis and computations by doing away with metric inequalities. Then w...
متن کاملThe Multi-terminal Vertex Separator Problem: Polyhedral Analysis and Branch-and- Cut
Let G = (V ∪ T, E) be an undirected graph such that V is a set of vertices, E a set of edges and T a set of terminal vertices. The Multi-terminal vertex separator problem consists in partitioning V into k + 1 subsets {S, V1,..., Vk} minimizing the size of S and such that there is no edge between two subsets Vi and Vj and each subset Vi contains exactly one terminal. Set S is called a separator....
متن کامل